Historical Traversals in Native Graph Databases
نویسندگان
چکیده
Since most graph data, such as data from social, citation and computer networks evolve over time, it is useful to be able to query their history. In this paper, we focus on supporting traversals of such graphs using a native graph database. We assume that we are given the history of an evolving graph as a sequence of graph snapshots representing the state of the graph at different time instances. We introduce models for storing such snapshots in the graph database and we propose algorithms for supporting various types of historical reachability and shortest path queries. Finally, we experimentally evaluate and compare the various models and algorithms using both real and synthetic datasets.
منابع مشابه
Efficient Single Step Traversals in Main-Memory Graph-Shaped Data
Management of graph-shaped data gained a momentum to both industry and research. Traversal queries through a graph-shaped dataset are easy to express, and can be efficiently executed using graph databases. High-performance traversals through graphshaped data is claimed to be enabled by native graph storage (i.e., encoding data using graph data structures), and native graph processing (i.e., ope...
متن کاملBest Practices for Developing Graph Database Applications: A Case Study Using Apache Titan Best Practices for Developing Graph Database Applications: A Case Study Using Apache Titan
Networks and their interactions permeate every aspect of our lives, from our cells and the ecosphere to planetary systems. In recent years, computational network science has emerged as an active field, bringing forward an abundance of tools that help us gain insights into the interconnected systems that surround us (e.g. the personalized relevance of websites from within the whole Web). Graph d...
متن کاملA Modular and Statically Typed Effectful Stack for Custom Graph Traversals
Programmers often have to implement custom graph traversals by hand as either there are no suitable text-book algorithms for their tasks, or their problems are too complex for a pure querying language that lacks modularity or static typing. Our new Scala-based graph traversal language uses an effectful stack that adapts monads and type classes. Arbitrary graph effect computations and graph proc...
متن کاملThe Potosí principle: religious prosociality fosters self-organization of larger communities under extreme natural and economic conditions
We show how in colonial Potosı́ (present-day Bolivia) social and political stability was achieved through the self-organization of society through the repetition of religious rituals. Our analysis shows that the population of Potosı́ develops over the time a series of cycles of rituals and miracles as a response to social upheaval and natural disasters and that these cycles of religious performan...
متن کاملMining Frequent Patterns from Weighted Traversals on Graph using Confidence Interval and Pattern Priority
A lot of real world problems can be modeled as traversals on graph. Mining from such traversals has been found useful in several applications. However, previous works considered only unweighted traversals. This paper generalizes this to the case where traversals are given weights to reflect their importance. A new algorithm is proposed to discover frequent patterns from the weighted traversals....
متن کامل